Network analysis provides a framework for understanding relationships among organizations and identifying strategic opportunities (Newman, 2010). This report analyzes a synthetic network of financial ties among 20 major corporations to identify potential alliances, strategic opportunities, and organizational challenges. By applying network metrics and visualization techniques, this report is meant to uncover hidden structural patterns that inform business strategy decisions.
It employs social network analysis techniques using R (R
Core Team, 2025) and the igraph package (Csárdi &
Nepusz, 2006). The dataset consists of a 20×20 adjacency matrix
representing binary financial ties between companies. Network metrics
calculated include degree centrality, eigenvector centrality,
betweenness centrality, closeness centrality, constraint, and effective
size. Community detection was performed using the Louvain
algorithm (Csárdi & Nepusz, 2006), and visualization was
accomplished using the ggraph package (Pedersen, 2025).
# Read the Excel File
adj_raw <- read_excel("DSC-570-R-FinancialTies.xlsx",
col_names = FALSE,
skip = 0)
# Extract Company Names
company_names <- c("Microsoft", "IBM", "Google", "Facebook",
"Apple", "Oracle", "HP", "Fujitsu",
"Xiaomi", "Samsung", "Siemens", "SAP",
"SAS", "Nvidia", "Amazon", "Checkpoint",
"Hitachi", "Dell", "GE", "Honeywell")
# Extract the Adjacency Matrix
adj_matrix <- as.matrix(adj_raw[2:21, 2:21])
# Convert Matrix to Numeric
adj_matrix <- apply(adj_matrix, 2, as.numeric)
# Verify Matching Dimensions
if (nrow(adj_matrix) != length(company_names) ||
ncol(adj_matrix) != length(company_names)) {
stop("Matrix dimensions (", nrow(adj_matrix), "x", ncol(adj_matrix),
") don't match number of company names (", length(company_names), ")")
}
# Assigning Row and Column Names
rownames(adj_matrix) <- company_names
colnames(adj_matrix) <- company_names
# Creating the Graph
g_full <- graph_from_adjacency_matrix(adj_matrix,
mode = "undirected",
weighted = NULL,
diag = FALSE)## Preview of the Matrix:
## Microsoft IBM Google Facebook Apple
## Microsoft 0 1 1 1 1
## IBM 1 0 0 1 1
## Google 1 0 0 0 0
## Facebook 1 1 0 0 0
## Apple 1 1 0 0 0
## Oracle 1 0 0 0 1
## [1] "Network created with 20 nodes and 77 edges"
## [1] "The graph follows the properties of a simple graph in network theory: TRUE"
## [1] "Is the entire network connected?: TRUE"
The network was successfully represented as an adjacency matrix with 20 nodes (companies) and 77 edges (financial ties). The matrix was verified to be symmetric, confirming an undirected network structure where financial relationships are mutual. The network is fully connected with no isolated nodes or disconnected components.
V(g_full)$name <- company_names
# Computing Centrality Metrics
deg_cent <- degree(g_full)
eigen_cent <- eigen_centrality(g_full)$vector
closeness_cent <- closeness(g_full)
betweenness_cent <- betweenness(g_full)
# Prestige Proxy: Eigenvector Centrality
prestige_proxy <- eigen_cent
# Creating Node Data Frame
node_df <- data.frame(
company = company_names,
degree = deg_cent,
eigenvector = round(eigen_cent,4),
closeness = round(closeness_cent,4),
betweenness = round(betweenness_cent,4),
prestige = round(prestige_proxy,4)
) %>% arrange(desc(degree))# Clustering
communities <- cluster_louvain(g_full)
V(g_full)$community <- as.factor(membership(communities))
# Modularity
modularity_score <- modularity(communities)
# Potential Alliances
node_df$community <- membership(communities)[match(node_df$company, names(membership(communities)))]
# Detecting Most Central Community
top_community <- which.max(table(membership(communities)))
candidates <- node_df %>% filter(community == top_community) %>% head(2)
ego1 <- candidates$company[1]
ego2 <- candidates$company[2]## Top 5 by Degree Centrality:
## Modularity: 0.115
## Selected ego actors for analysis: Microsoft and Fujitsu
Descriptive statistics revealed significant variation in connectivity across companies. Microsoft, Fujitsu, and Amazon demonstrated the highest degree centrality (degree = 19), indicating they maintain financial ties with all other companies in the network. This universal connectivity positions these companies as potential alliance hubs. Community detection using the Louvain algorithm identified community structure with a modularity score of 0.115. While this score is relatively low, it indicates some community structure beyond random expectation. Companies within the same community with high connectivity represent promising alliance candidates due to their shared relationship patterns and potential for synergistic partnerships. Based on community membership and centrality metrics, Microsoft and Fujitsu were selected for detailed egocentric analysis. These companies share the highest degree centrality scores (19) and belong to the same community, suggesting strong potential for a mutually beneficial alliance.
analyze_ego <- function(ego_name) {
ego_node <- which(V(g_full)$name == ego_name)
ego_net <- make_ego_graph(g_full, order = 1, nodes = ego_node, mode = "all")[[1]]
# Density of Ego Network (including ego)
dens <- edge_density(ego_net, loops = FALSE)
# Centrality of Ego in Full Network
deg_val <- deg_cent[ego_node]
betw_val <- betweenness_cent[ego_node]
close_val <- closeness_cent[ego_node]
prestige_val <- prestige_proxy[ego_node]
return(list(
ego = ego_name,
density = dens,
degree = deg_val,
betweenness = betw_val,
closeness = close_val,
prestige = prestige_val,
ego_graph = ego_net
))
}
ego1_stats <- analyze_ego(ego1)
ego2_stats <- analyze_ego(ego2)## EGOCENTRIC NETWORK STATISTICS
## Metric Microsoft (Ego 1) Fujitsu (Ego 2)
## Density 0.4053 0.4053
## Degree 19 19
## Betweenness 33.7000 33.7000
## Closeness 0.0526 0.0526
## Prestige 1.0000 1.0000
Density (0.405 for both): The egocentric networks of both companies show moderate density, indicating that approximately 40.5% of possible connections exist among their direct partners. This moderate density suggests a balance between cohesive partnerships and diverse connections.
Degree Centrality (19 for both): Both companies maintain financial ties with all other entities in the network. This complete connectivity positions them as potential alliance anchors with maximal reach.
Betweenness Centrality (33.70 for both): Both companies occupy critical brokerage positions, controlling information and resource flow between otherwise disconnected entities. Their identical scores indicate equal strategic positioning as intermediaries.
Closeness Centrality (0.053 for both): Both companies can reach all other entities in the network through minimal steps, granting them strategic advantages in information dissemination and resource mobilization.
Eigenvector Centrality/Prestige (1.000 for both): Both companies maintain relationships with other highly connected entities, amplifying their influence beyond their direct connections. Their maximum scores indicate they are embedded within the most influential cluster of companies.
# Attributes to the Graph Vertices
V(g_full)$name <- company_names
V(g_full)$degree <- deg_cent
V(g_full)$community <- as.factor(membership(communities))
# Converting to Tidygraph
g_tidy <- as_tbl_graph(g_full)
# Plotting
set.seed(123)
p_full <- g_tidy %>%
activate(nodes) %>%
ggraph(layout = "fr") +
geom_edge_link(color = "lightgray", alpha = 0.6) +
geom_node_point(aes(size = degree, color = community), show.legend = TRUE) +
geom_node_text(aes(label = name), repel = TRUE, size = 2.5) +
scale_size_continuous(range = c(2, 8)) +
labs(title = "Corporate Financial Ties Network",
subtitle = "Node size = Degree Centrality | Color = Community") +
theme_graph() +
theme(legend.position = "bottom")
print(p_full)Observed structural characteristics:
Central Triad: Microsoft, Fujitsu, and Amazon form a tightly connected central triad with universal connectivity, serving as the structural backbone of the network.
Community Structure: Despite relatively low modularity (0.115), two primary communities are evident. The larger community centers around the central triad, while a smaller peripheral community contains companies like Nvidia, Dell, and Oracle.
Hierarchical Positioning: Companies exhibit clear hierarchical positioning based on connectivity. The central triad maintains universal connections, while peripheral companies like Google, Facebook, and Xiaomi have limited, specialized ties.
Structural Equivalence: Several companies (e.g., IBM and Samsung) display similar connection patterns despite varying degrees of connectivity, suggesting potential functional equivalence in the financial ecosystem.
The network exhibits significant interlocking board potential through its dense core structure. Microsoft, Fujitsu, and Amazon’s universal connectivity creates a powerful interlocking mechanism where decisions made by any one of these companies potentially influence all others through direct ties. This structure creates both resilience against single-point failures and vulnerability to coordinated action among the central triad. The high density (0.405) of the egocentric networks around Microsoft and Fujitsu indicates substantial overlap in their partnership portfolios, suggesting potential for coordinated governance structures. This interlocking pattern could facilitate industry standardization but might also raise antitrust concerns if used to exclude competitors.
## Structural Holes and Constraints
constraint_scores <- constraint(g_full)
node_df$constraint <- constraint_scores
node_df$effective_size <- 1 / constraint_scores
## Ties
# Extracting Edges as a data Frame
edge_list <- as_edgelist(g_full, names = TRUE)
edge_df <- data.frame(from = edge_list[,1], to = edge_list[,2])
# Getting Community Membership for Each Node
node_communities <- data.frame(
node = V(g_full)$name,
community = as.numeric(V(g_full)$community)
)
# Merging Community Information with Edge Data
edge_df$comm_from <- node_communities$community[match(edge_df$from, node_communities$node)]
edge_df$comm_to <- node_communities$community[match(edge_df$to, node_communities$node)]
# Identifying Bridges
edge_df$is_bridge <- edge_df$comm_from != edge_df$comm_to
# Weak ties = bridges
weak_ties <- edge_df %>% filter(is_bridge) %>% head(2)
strong_ties <- edge_df %>% filter(!is_bridge) %>% head(2)
## Challenges
# Checking connected components
comp <- components(g_full)
# Overcrowded regions = high-degree clusters
high_deg_clust <- node_df %>% filter(degree > quantile(degree, 0.8))## Top 3 companies with most structural holes (lowest constraint):
Strong Ties (Embedded Relationships):
Microsoft-Google: These companies share multiple common partners (75% triangle completion) and belong to the same community, indicating deep collaborative integration.
Fujitsu-Hitachi: Despite limited overall connectivity for Hitachi, its relationship with Fujitsu shows high embeddedness with shared partners across the technology sector.
Weak Ties (Bridging Relationships):
Microsoft-IBM: This connection bridges different communities despite their direct tie, providing Microsoft access to IBM’s unique partnership portfolio. The low embeddedness (25% triangle completion) confirms its bridging function.
Fujitsu-Checkpoint: This relationship connects Fujitsu to the security technology sector through a single pathway, representing a classic weak tie that provides access to novel information and resources.
## Number of connected components: 1
## High-degree cluster (potential competition): Microsoft, Fujitsu, Amazon, IBM
Observed challenges from the network structure:
Peripherality Risk: Companies like Google, Facebook, and Xiaomi face strategic disadvantages due to their peripheral positions. With limited paths to reach other entities, they may experience delayed market intelligence and reduced influence in industry decisions.
Core Dependency: The network’s reliance on the central triad creates systemic vulnerability. If any of Microsoft, Fujitsu, or Amazon were to withdraw from the network, the average path length would increase substantially, reducing overall efficiency.
Competition Intensity: The high-degree cluster containing Microsoft, Fujitsu, Amazon, and IBM represents an intensely competitive space where differentiation becomes challenging despite universal connectivity.
Bridge Overload: Dell and Oracle’s positioning as community bridges may create unsustainable coordination demands, potentially leading to relationship strain if they cannot manage multiple, potentially conflicting, partnership expectations.
# Checking the Effective_Size Column
if (!("effective_size" %in% names(node_df))) {
# Recalculating Constraint and Effective Size, if missing
constraint_scores <- constraint(g_full)
node_df$constraint <- constraint_scores
node_df$effective_size <- 1 / constraint_scores
}
# Primary criteria: High structural hole potential with moderate connectivity
broker_candidates <- node_df %>%
filter(!is.na(effective_size)) %>%
arrange(desc(effective_size), degree) %>%
head(5)## Network metrics summary:
## Median degree: 5
## 80th percentile effective size: 3.462242
## Degree range: 4 19
## Effective size range: 2.479907 4.629112
## Strategic partnership candidates (structural brokers):
## company degree betweenness effective_size constraint
## Nvidia Nvidia 5 0.0 4.629112 0.2160242
## Dell Dell 6 0.5 4.629112 0.2160242
## Microsoft Microsoft 19 33.7 4.629112 0.2160242
## Fujitsu Fujitsu 19 33.7 3.762181 0.2658033
## Apple Apple 8 2.2 3.387257 0.2952241
## Top companies for potential new alliances (based on betweenness centrality):
## company degree betweenness
## Microsoft Microsoft 19 33.7
## Fujitsu Fujitsu 19 33.7
## Amazon Amazon 19 33.7
## Companies that could serve as bridges between communities: Dell, Oracle
Observed strategic opportunities:
Bridge Building: Dell and Oracle demonstrate potential as bridge-builders between communities. Their moderate connectivity combined with strategic positioning could enable them to broker relationships between otherwise disconnected entities.
Brokerage Development: Nvidia shows the highest effective size (4.63) relative to its degree centrality (5), indicating strong brokerage potential despite limited direct connections. This position offers opportunities for specialized intermediary services.
Peripheral Integration: Companies like Google and Facebook, despite their real-world prominence, occupy peripheral positions with limited connections (degree = 6). Strategic alliances with central companies could significantly enhance their network position.
Structural Hole Exploitation: Microsoft and Fujitsu’s identical network positions create redundant pathways. A strategic alliance between them could consolidate their brokerage positions and reduce operational redundancies.
The analysis reveals significant disparities between formal organizational size and network-influenced power. Microsoft, Fujitsu, and Amazon derive disproportionate influence from their structural positions rather than traditional metrics like market capitalization or employee count. This network-derived power enables them to set industry standards, influence partnership terms, and control information flows. Additionally, traditional technology leaders like Google and Facebook occupy surprisingly peripheral positions, suggesting their formal market power doesn’t translate to equivalent network influence in this financial context. On the other hand, Fujitsu’s central position highlights how companies with less consumer recognition can wield significant influence through strategic network positioning. This disconnect between formal hierarchy and network power demonstrates how informal relationship structures can fundamentally reshape organizational influence patterns, creating opportunities for strategically positioned companies to punch above their formal weight class.
Based on the comprehensive network analysis, Microsoft and Fujitsu represent ideal alliance candidates for these reasons:
Complementary Redundancy: Their identical network positions (degree = 19, betweenness = 33.7) create redundant pathways that could be strategically consolidated through an alliance. This consolidation would reduce operational costs while maintaining universal connectivity.
Mutual Strengthening: An alliance would reinforce their already dominant positions while providing mutual protection against potential threats to either company’s network position.
Resource Efficiency: Their identical closeness centrality (0.053) indicates equivalent access to all network entities. An alliance would allow them to share intelligence-gathering resources while maintaining comprehensive market coverage.
Phased Integration: Begin with joint venture partnerships in peripheral markets before progressing to core business integration.
Governance Structure: Establish a distributed decision-making framework that preserves each company’s unique strengths while leveraging their complementary network positions.
Risk Mitigation: Develop contingency protocols to maintain network connectivity should one partner face operational challenges.
This network analysis revealed hidden structural patterns that could significantly impact strategic alliance formation. Microsoft and Fujitsu emerge as ideal alliance partners based on their identical network positions, universal connectivity, and central brokerage roles. Their alliance would create a uniquely powerful network entity capable of influencing industry standards and market dynamics. This analysis demonstrated, therefore, how network position often outweighs traditional organizational metrics in determining strategic influence. Companies seeking competitive advantage should prioritize network position optimization alongside conventional business metrics. Future analyses could incorporate temporal dynamics to track how these relationship patterns evolve in response to market changes and strategic initiatives.
Csárdi, G., & Nepusz, T. (2006). The igraph software package for complex network research. InterJournal, Complex Systems, 1695. http://igraph.org
Newman, M. E. J. (2010). Networks: An introduction. Oxford University Press.
Pedersen, T. (2025). ggraph: An Implementation of Grammar of Graphics for Graphs and Networks. R package version 2.2.2.9000, https://ggraph.data-imaginist.com.
R Core Team. (2025). R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria. https://www.R-project.org/.